Testing Equivalences for Processes
نویسندگان
چکیده
Given a set of processes and a set of tests on these processes we show how to define in a natural way three different eyuitalences on processes. ThesP equivalences are applied to a particular language CCS. We give associated complete proof systems and fully abstract models. These models have a simple representation in terms of trees.
منابع مشابه
On the Discriminating Power of Testing Equivalences for Reactive Probabilistic Systems: Results and Open Problems
Testing equivalences have been deeply investigated on fully nondeterministic processes, as well as on processes featuring probabilities and internal nondeterminism. This is not the case with reactive probabilistic processes, for which it is only known that the discriminating power of probabilistic bisimilarity is achieved when admitting a copying capability within tests. In this paper, we intro...
متن کاملRevisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
One of the most studied extensions of testing theory to nondeterministic and probabilistic processes yields unrealistic probabilities estimations that give rise to two anomalies. First, probabilistic testing equivalence does not imply probabilistic trace equivalence. Second, probabilistic testing equivalence differentiates processes that perform the same sequence of actions with the same probab...
متن کاملA Companion of "Relating Strong Behavioral Equivalences for Processes with Nondeterminism and Probabilities"
In the paper “Relating Strong Behavioral Equivalences for Processes with Nondeterminism and Probabilities” to appear in Theoretical Computer Science, we present a comparison of behavioral equivalences for nondeterministic and probabilistic processes. In particular, we consider strong trace, failure, testing, and bisimulation equivalences. For each of these groups of equivalences, we examine the...
متن کاملUniform Logical Characterizations of Testing Equivalences for Nondeterministic, Probabilistic and Markovian Processes
Logical characterizations of nondeterministic, probabilistic, and Markovian variants of bisimulation equivalence rely on similar modal languages, each including true, negation, conjunction, and diamond. Likewise, logical characterizations of the corresponding variants of trace equivalence rely on similar modal languages, each including only true and diamond. Unfortunately, this is not the case ...
متن کاملThe Spectrum of Strong Behavioral Equivalences for Nondeterministic and Probabilistic Processes
We present a spectrum of trace-based, testing, and bisimulation equivalences for nondeterministic and probabilistic processes whose activities are all observable. For every equivalence under study, we examine the discriminating power of three variants stemming from three approaches that differ for the way probabilities of events are compared when nondeterministic choices are resolved via determ...
متن کاملA Hierarchy of Equivalences for Probabilistic Processes
We study several process equivalences on a probabilistic process algebra. First, we define an operational semantics. Afterwards we introduce the notion of passing a test with a probability. We consider three families of tests according to the intended behavior of an external observer: Reactive (sequential tests), generative (branching tests), and limited generative (equitable branching tests). ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 34 شماره
صفحات -
تاریخ انتشار 1984